Multi-objective Service Monitoring Rate Optimization using Memetic Algorithm

نویسندگان

  • Pan He
  • Junhao Wen
  • Kaigui Wu
  • Peng Li
  • Haijun Ren
چکیده

In dynamic service-oriented environment, service monitoring could provide reliability improvement to service composition as well as cost increase. To reduce the overall cost brought by monitoring, existing literatures proposed to decrease the number of monitors through monitoring the most reliability-sensitive services. However, the optimal monitoring rate for those monitors was not taken into account at the same time. Aiming at choosing optimal monitoring rate for minimal number of monitors, this paper proposed to search appropriate monitoring rate to minimize multi kinds of resources cost by monitoring under reliability constraints. Firstly, two multi-objective optimization problems were presented with the reliability and cost models of service composition under monitoring analyzed through Markov chain. Then a multi-objective memetic algorithm (MOMA) was used to search the near-optimal solutions of monitoring rate for services. This algorithm employed nondominated sorting strategy as the global search method and used random walk with direction exploitation method as local search operator. Experimental studies results showed that multi-objective approach for service monitoring rate optimization could provide solutions with a variety of trade-offs between the system reliability and cost comparing with existing greedy sensitivity-based method. Comparison with other multi-objective evolutionary algorithms showed that, in terms of both the coverage rate and hypervolume indicator, MOMA searched more effectively than several state-of-art algorithms including NSGA II, PHC-NSGA-II and HaD-MOEA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MMDT: Multi-Objective Memetic Rule Learning from Decision Tree

In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...

متن کامل

One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm

Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...

متن کامل

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

متن کامل

An Improved Decomposition-Based Memetic Algorithm for Multi-Objective Capacitated Arc Routing Problem

The Capacitated Arc Routing Problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary algorithms. However, almost all such attempts formulate CARP as a single-objective problem altho...

متن کامل

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012